Understanding Cutting Planes for QBFs
نویسندگان
چکیده
We define a cutting planes system CP+∀red for quantified Boolean formulas (QBF) and analyse the proof-theoretic strength of this new calculus. While in the propositional case, Cutting Planes is of intermediate strength between resolution and Frege, our findings here show that the situation in QBF is slightly more complex: while CP+∀red is again weaker than QBF Frege and stronger than the CDCL-based QBF resolution systems Q-Res and QU-Res, it turns out to be incomparable to even the weakest expansion-based QBF resolution system ∀Exp+Res. Technically, our results establish the effectiveness of two lower bound techniques for CP+∀red: via strategy extraction and via monotone feasible interpolation. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems: Complexity of proof procedures
منابع مشابه
Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs
As a natural extension of the SAT problem, different proof systems for quantified Boolean formulas (QBF) have been proposed. Many of these extend a propositional system to handle universal quantifiers. By formalising the construction of the QBF proof system P+∀red from a propositional proof system P (Beyersdorff, Bonacina & Chew, ITCS ‘16), we present a new technique for proving proof size lowe...
متن کاملCorner Polyhedra and Maximal Lattice-free Convex Sets : A Geometric Approach to Cutting Plane Theory
Corner Polyhedra were introduced by Gomory in the early 60s and were studied by Gomory and Johnson. The importance of the corner polyhedron is underscored by the fact that almost all “generic” cutting planes, both in the theoretical literature as well as ones used in practice, are valid for the corner polyhedron. So the corner polyhedron can be viewed as a unifying structure from which many of ...
متن کاملA separation between semantic and syntactic cutting planes
In this note we argue that semantic cutting planes refutations are stronger than syntactic ones. In particular, we give a formula for which any refutation in syntactic cutting planes requires exponential length, while there is a polynomial length refutation in semantic cutting planes. This means that syntactic cutting planes does not p-simulate (nor simulate) semantic cutting planes. We also gi...
متن کاملSemantic Versus Syntactic Cutting Planes
In this paper, we compare the strength of the semantic and syntactic version of the cutting planes proof system. First, we show that the lower bound technique of [22] applies also to semantic cutting planes: the proof system has feasible interpolation via monotone real circuits, which gives an exponential lower bound on lengths of semantic cutting planes refutations. Second, we show that semant...
متن کاملOn Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean Optimization (PBO) algorithms. This paper addresses the utilization of Gomory mixed-integer and clique cuts, in Satisfiability-based algorithms for PBO, and shows how these cuts can be used for computing lower bounds ...
متن کامل